Close

1. Identity statement
Reference TypeConference Paper (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Holder Codeibi 8JMKD3MGPEW34M/46T9EHH
Identifier6qtX3pFwXQZeBBx/DFNNa
Repositorysid.inpe.br/banon/2004/10.06.16.04
Last Update2004:10.06.03.00.00 (UTC) administrator
Metadata Repositorysid.inpe.br/banon/2004/10.06.16.04.24
Metadata Last Update2022:06.14.00.12.51 (UTC) administrator
DOI10.1109/SIBGRA.2004.1352969
Citation KeyParariEspeOlivCava:2004:FaPoVa
TitleFast Polygonization of Variational Implicit Surfaces
FormatOn-line
Year2004
Access Date2024, Apr. 29
Number of Files1
Size408 KiB
2. Context
Author1 Parari, Alvaro Cuno
2 Esperança, Claudio
3 Oliveira, Antonio Alberto Fernandes de
4 Cavalcanti, Paulo Roma
Affiliation1 COPPE/UFRJ
EditorAraújo, Arnaldo de Albuquerque
Comba, João Luiz Dihl
Navazo, Isabel
Sousa, Antônio Augusto de
e-Mail Addressesperanc@lcg.ufrj.br
Conference NameBrazilian Symposium on Computer Graphics and Image Processing, 17 (SIBGRAPI) - Ibero-American Symposium on Computer Graphics, 2 (SIACG)
Conference LocationCuritiba, PR, Brazil
Date17-20 Oct. 2004
PublisherIEEE Computer Society
Book TitleProceedings
Tertiary TypeFull Paper
History (UTC)2008-07-17 14:10:58 :: esperanc -> banon ::
2008-08-26 15:15:44 :: banon -> administrator ::
2009-08-13 20:37:40 :: administrator -> banon ::
2010-08-28 20:01:16 :: banon -> administrator ::
2022-06-14 00:12:51 :: administrator -> :: 2004
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Version Typefinaldraft
Keywordspolygonization
implicit surfaces
RBF
AbstractThis article presents a simple hierarchical adaptation of the Marching Cubes algorithm for polygonizing variational implicit surfaces used in modelling and reconstruction applications. The technique relies on placing the normal and boundary constraint points respecting a pseudo-Euclidean distance metrics. This procedure makes it possible to quickly prune the space and minimize the number of costly function evaluations and thus converge rapidly to the surface. Timings show that this technique tends to perform faster than Bloomenthal's continuation polygonizer.
Arrangement 1urlib.net > SDLA > Fonds > SIBGRAPI 2004 > Fast Polygonization of...
Arrangement 2urlib.net > SDLA > Fonds > Full Index > Fast Polygonization of...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Contentthere are no files
4. Conditions of access and use
data URLhttp://urlib.net/ibi/6qtX3pFwXQZeBBx/DFNNa
zipped data URLhttp://urlib.net/zip/6qtX3pFwXQZeBBx/DFNNa
Languageen
Target Filevispoly_paper.pdf
User Groupesperanc
administrator
Visibilityshown
5. Allied materials
Next Higher Units8JMKD3MGPEW34M/46QM2BE
8JMKD3MGPEW34M/4742MCS
Citing Item Listsid.inpe.br/sibgrapi/2022/05.03.00.29 7
Host Collectionsid.inpe.br/banon/2001/03.30.15.38
6. Notes
Empty Fieldsarchivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage edition electronicmailaddress group isbn issn label lineage mark mirrorrepository nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project publisheraddress readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume


Close